Towards the Integration of Constraint Logic Programming and Mathematical Programming
نویسنده
چکیده
Preface During the first days of the new millennium I started my research project at Paragon Decision Technology in Haarlem, the Netherlands. That was January 3, 2000. Some 6 months later, the research project is finished, and the report is in front of the reader. As for the writer, a feeling of satisfaction has come over him. This thesis concerns a subject that is quite promising. Since it is not a regular subject of my graduate program, quite a lot of time had to be spent on the theoretical background. Furthermore, several practical applications of the subject were considered. This mixture of theory and applications turned out to be an ideal combination for me. I would like to thank the following persons: J. Bisschop, for being an inspiring supervisor, for reviewing this thesis, but mostly for enabling me to carry out this research project at this level. Koos Heerink, for supporting me during the implementation of the programs, for answering other questions that appeared, and for reading this thesis. J. Hurink, for reading this thesis. The colleagues at Paragon Decision Technology, for providing a nice working environment.
منابع مشابه
A Node-based Mathematical Model towards the Location Routing Problem with Intermediate Replenishment Facilities under Capacity Constraint
In this paper, we study the location routing problem with replenishment facilities (LRPRF), an extension of the location routing problem (LRP) where the vehicles can replenish at some replenishment facilities. Vehicles leave the depot with load on-board, serve customers until out of load, and then either return to a replenishment facility to reload or return to the depot, completing their route...
متن کاملTowards Supply Chain Planning Integration: Uncertainty Analysis Using Fuzzy Mathematical Programming Approach in a Plastic Forming Company
Affected by globalization and increased complexity, supply chain managers have learned about the importance of Sales and Operations Planning (S&OP). However, in large scale supply chains, S&OP has received little attention, by both academics and practitioners. The purpose of this manuscript is to investigate the advantages of S&OP process using a mathematical modeling approach in a large scale ...
متن کاملComparing Mixed-Integer and Constraint Programming for the No-Wait Flow Shop Problem with Due Date Constraints
The impetus for this research was examining a flow shop problem in which tasks were expected to be successively carried out with no time interval (i.e., no wait time) between them. For this reason, they should be completed by specific dates or deadlines. In this regard, the efficiency of the models was evaluated based on makespan. To solve the NP-Hard problem, we developed two mathematical mode...
متن کاملEplex: Harnessing Mathematical Programming Solvers for Constraint Logic Programming
The eplex library of the ECLPS Constraint Logic Programming platform allows the integration of Mathematical Programming techniques with its native Constraint Logic Programming techniques within the same unified framework. It provides an interface to state-of-the-art Mathematical Programming solvers, and a set of programming primitives that allow ‘hybrid’ techniques to be easily expressed. This ...
متن کاملA Mathematical Optimization Model for Solving Minimum Ordering Problem with Constraint Analysis and some Generalizations
In this paper, a mathematical method is proposed to formulate a generalized ordering problem. This model is formed as a linear optimization model in which some variables are binary. The constraints of the problem have been analyzed with the emphasis on the assessment of their importance in the formulation. On the one hand, these constraints enforce conditions on an arbitrary subgraph and then g...
متن کاملA General Scalar-Valued Gap Function for Nonsmooth Multiobjective Semi-Infinite Programming
For a nonsmooth multiobjective mathematical programming problem governed by infinitely many constraints, we define a new gap function that generalizes the definitions of this concept in other articles. Then, we characterize the efficient, weakly efficient, and properly efficient solutions of the problem utilizing this new gap function. Our results are based on $(Phi,rho)-$invexity,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000